An explicit parallelism study based on thread-level speculation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An explicit parallelism study based on thread-level speculation

Developments in parallel architectures are an important branch in computer science. The success of such architectures derives from their inherent ability to improve the program performances. However, their ability to improve the performance on programs depends on the parallelism extraction strategies, which are always limited by the logic of each sequential program. Speculation is the only know...

متن کامل

Min-cut-based Program Decomposition for Thread-level Speculation

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix

متن کامل

Thread-Level Speculation for Web Applications

Thread Level Speculation (TLS) has been suggested as a mean to automatically (or semi-automatically) extract parallelism from sequential programs. While there have been multiple attempts both in hardware and software to implement real time TLS, to the best of our knowledge all attempts have so far been on a byte code level or with statically typed languages. In this study, we examine the potent...

متن کامل

Parallelizing Database Systems using Thread Level Speculation

Improving the performance of a program by splitting it into threads is hard, since a parallel machine model is more complex than a sequential one. Thread Level Speculation (TLS) allows a program to be parallelized while retaining sequential program semantics. In the past TLS has been shown to make automatic parallelization of programs much easier—in this paper we show that TLS makes manual para...

متن کامل

Compiler-Assisted Thread Level Control Speculation

This paper proposes two compiler-assisted techniques to improve thread level control speculation in speculative multithreading execution. The first technique is to identify threads which have exactly one successor and the successor’s address is statically known (we call these threads fixed-successor threads), and use a small full associative buffer to predict the successors. This technique redu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: CLEI Electronic Journal

سال: 2014

ISSN: 0717-5000

DOI: 10.19153/cleiej.17.2.8